Encoder and encoding method

ABSTRACT

An encoder includes circuitry and a memory coupled to the circuitry. The circuitry, in operation, determines whether or not a ternary split process of splitting a block into three sub blocks in a first direction parallel to a first longer side of the block is allowed by comparing a size of a second shorter side of the block to a minimum threshold value. The circuitry, responsive to the ternary split process being allowed, writes, into a bitstream, a split direction parameter indicative of a splitting direction. The circuitry, in operation, splits the block into a plurality of sub blocks in a direction indicated by the split direction parameter; and encodes the plurality of sub blocks.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a U.S. continuation of U.S. application Ser. No.16/997,147 filed on Aug. 19, 2020, which is a U.S. continuationapplication of PCT International Patent Application NumberPCT/JP2019/008467 filed on Mar. 4, 2019, claiming the benefit ofpriority of U.S. Provisional Patent Application Nos. 62/638,674 and62/638,626 filed on Mar. 5, 2018, the entire contents of which arehereby incorporated by reference.

BACKGROUND 1. Technical Field

The present disclosure relates to an encoder, a decoder, an encodingmethod, and a decoding method.

2. Description of the Related Art

The video coding standards known as High-Efficiency Video Coding (HEVC)is standardized by the Joint Collaborative Team on Video Coding(JCT-VC).

SUMMARY

A decoder according to one aspect of the present disclosure includes:circuitry; and a memory coupled to the circuitry. The circuitry, inoperation: determines whether or not a first splitting of splitting ablock into three sub blocks in a first direction parallel to a firstside of the block is available by determining a magnitude relationbetween a size of a second side of the block and a first value, thesecond side being different from the first side, the first side being alonger side of the block; when the first splitting is available, parses,from a bitstream, a split direction parameter indicative of a splittingdirection; splits the block into a plurality of sub blocks in adirection indicated by the split direction parameter; and decodes theplurality of sub blocks.

Note that these general or specific aspects of the present disclosuremay be implemented as a system, a method, an integrated circuit, acomputer program, a computer-readable recording medium such as a CD-ROM,or by any combination of systems, methods, integrated circuits, computerprograms, and recording media.

BRIEF DESCRIPTION OF DRAWINGS

These and other objects, advantages and features of the disclosure willbecome apparent from the following description thereof taken inconjunction with the accompanying drawings that illustrate a specificembodiment of the present disclosure.

FIG. 1 is a block diagram illustrating a functional configuration of anencoder according to Embodiment 1;

FIG. 2 illustrates one example of block splitting according toEmbodiment 1;

FIG. 3 is a chart indicating transform basis functions for eachtransform type;

FIG. 4A illustrates one example of a filter shape used in ALF;

FIG. 4B illustrates another example of a filter shape used in ALF;

FIG. 4C illustrates another example of a filter shape used in ALF;

FIG. 5A illustrates 67 intra prediction modes used in intra prediction;

FIG. 5B is a flow chart for illustrating an outline of a predictionimage correction process performed via OBMC processing;

FIG. 5C is a conceptual diagram for illustrating an outline of aprediction image correction process performed via OBMC processing;

FIG. 5D illustrates one example of FRUC;

FIG. 6 is for illustrating pattern matching (bilateral matching) betweentwo blocks along a motion trajectory;

FIG. 7 is for illustrating pattern matching (template matching) betweena template in the current picture and a block in a reference picture;

FIG. 8 is for illustrating a model assuming uniform linear motion;

FIG. 9A is for illustrating deriving a motion vector of each sub-blockbased on motion vectors of neighboring blocks;

FIG. 9B is for illustrating an outline of a process for deriving amotion vector via merge mode;

FIG. 9C is a conceptual diagram for illustrating an outline of DMVRprocessing;

FIG. 9D is for illustrating an outline of a prediction image generationmethod using a luminance correction process performed via LICprocessing.

FIG. 10 is a block diagram illustrating a functional configuration of adecoder according to Embodiment 1;

FIG. 11 illustrates an encoding method and an encoding process performedby an encoder according to the first aspect;

FIG. 12 illustrates that when it is determined that a first cost islower than all of second costs, a second set of block coding processesexcludes a third block coding process including a step of firstlypartitioning a block into three smaller partitions;

FIG. 13 illustrates other examples of first costs having differentbinary tree depths;

FIG. 14 illustrates an encoding method and an encoding process performedby an encoder according to the second aspect;

FIG. 15 illustrates that when it is determined that any one of firstcosts is lower than all of second costs, a block coding process isselected from a second set of block coding processes;

FIG. 16 illustrates an encoding method and an encoding process performedby an encoder according to the third aspect;

FIG. 17 illustrates that when a vertical gradient of a rectangular blockwhose height is greater than its width is greater than its horizontal ordiagonal gradient, a second set of block coding processes excludes afirst block coding process including a step of firstly partitioning ablock into three smaller partitions in a vertical direction;

FIG. 18 illustrates that when a vertical gradient of a rectangular blockwhose width is greater than its height is greater than its horizontal ordiagonal gradient, a second set of block coding processes excludes afirst block coding process including a step of firstly partitioning ablock into three smaller partitions in a horizontal direction;

FIG. 19A illustrates an example of calculation of a change in pixelintensity in a horizontal direction;

FIG. 19B illustrates an example of the calculation of a change in pixelintensity in the horizontal direction;

FIG. 20 illustrates an encoding method and an encoding process performedby an encoder according to the fourth aspect;

(a) in FIG. 21 illustrates that when a block coding process generates anarea of a sub partition which is half the area of a block and ahorizontal gradient is greater than a vertical gradient, a block codingprocess is selected from the second set of block coding processes;

(b) in FIG. 21 illustrates that when a block coding process generates anarea of a sub partition which is half the area of a block and a verticalgradient is greater than a horizontal gradient, a block coding processis selected from the second set of block coding processes;

FIG. 22 illustrates an encoding method and an encoding process performedby an encoder according to the fifth aspect;

FIG. 23A illustrates an example of splitting a 16×8 block into threesmaller partitions in a direction parallel to the height of the 16×8block when transform is not implemented for 16×2;

FIG. 23B illustrates an example of splitting a 16×8 block into foursmaller partitions in a direction parallel to the height of the 16×8block when transform is not implemented for 16×2;

FIG. 24 illustrates an encoding method and an encoding process performedby an encoder according to the sixth aspect;

FIG. 25A illustrates examples of a candidate for a partition structurefor splitting a 16×16 block;

FIG. 25B illustrates examples of a candidate for a partition structurefor splitting an 8×8 block;

FIG. 26 illustrates an encoding method and an encoding process performedby an encoder according to the seventh aspect;

FIG. 27 illustrates an example of ways to split a 32×32 block first intothree sub blocks, then the largest sub block into two partitions;

FIG. 28 illustrates an encoding method and an encoding process performedby an encoder according to the eighth aspect;

FIG. 29 illustrates an example of splitting a 64×64 block first intothree sub blocks, then each of the sub blocks into two partitions;

FIG. 30 illustrates examples of split modes and split directions forsplitting a block into two or three partitions;

FIG. 31 illustrates examples of locations of parameters in a bitstream;

FIG. 32 illustrates an overall configuration of a content providingsystem for implementing a content distribution service;

FIG. 33 illustrates one example of an encoding structure in scalableencoding;

FIG. 34 illustrates one example of an encoding structure in scalableencoding;

FIG. 35 illustrates an example of a display screen of a web page;

FIG. 36 illustrates an example of a display screen of a web page;

FIG. 37 illustrates one example of a smartphone; and

FIG. 38 is a block diagram illustrating a configuration example of asmartphone.

DETAILED DESCRIPTION OF THE EMBODIMENTS

Hereinafter, embodiments will be described with reference to thedrawings.

Note that the embodiments described below each show a general orspecific example. The numerical values, shapes, materials, components,the arrangement and connection of the components, steps, order of thesteps, etc. that are indicated in the following embodiments are mereexamples, and therefore are not intended to limit the scope of theclaims. Therefore, among the components in the following embodiments,those not recited in any of the independent claims defining the broadestinventive concepts are described as optional components.

Embodiment 1

First, an outline of Embodiment 1 will be presented. Embodiment 1 is oneexample of an encoder and a decoder to which the processes and/orconfigurations presented in subsequent description of aspects of thepresent disclosure are applicable. Note that Embodiment 1 is merely oneexample of an encoder and a decoder to which the processes and/orconfigurations presented in the description of aspects of the presentdisclosure are applicable. The processes and/or configurations presentedin the description of aspects of the present disclosure can also beimplemented in an encoder and a decoder different from those accordingto Embodiment 1.

When the processes and/or configurations presented in the description ofaspects of the present disclosure are applied to Embodiment 1, forexample, any of the following may be performed.

(1) regarding the encoder or the decoder according to Embodiment 1,among components included in the encoder or the decoder according toEmbodiment 1, substituting a component corresponding to a componentpresented in the description of aspects of the present disclosure with acomponent presented in the description of aspects of the presentdisclosure;

(2) regarding the encoder or the decoder according to Embodiment 1,implementing discretionary changes to functions or implemented processesperformed by one or more components included in the encoder or thedecoder according to Embodiment 1, such as addition, substitution, orremoval, etc., of such functions or implemented processes, thensubstituting a component corresponding to a component presented in thedescription of aspects of the present disclosure with a componentpresented in the description of aspects of the present disclosure;

(3) regarding the method implemented by the encoder or the decoderaccording to Embodiment 1, implementing discretionary changes such asaddition of processes and/or substitution, removal of one or more of theprocesses included in the method, and then substituting a processcorresponding to a process presented in the description of aspects ofthe present disclosure with a process presented in the description ofaspects of the present disclosure;

(4) combining one or more components included in the encoder or thedecoder according to Embodiment 1 with a component presented in thedescription of aspects of the present disclosure, a component includingone or more functions included in a component presented in thedescription of aspects of the present disclosure, or a component thatimplements one or more processes implemented by a component presented inthe description of aspects of the present disclosure;

(5) combining a component including one or more functions included inone or more components included in the encoder or the decoder accordingto Embodiment 1, or a component that implements one or more processesimplemented by one or more components included in the encoder or thedecoder according to Embodiment 1 with a component presented in thedescription of aspects of the present disclosure, a component includingone or more functions included in a component presented in thedescription of aspects of the present disclosure, or a component thatimplements one or more processes implemented by a component presented inthe description of aspects of the present disclosure;

(6) regarding the method implemented by the encoder or the decoderaccording to Embodiment 1, among processes included in the method,substituting a process corresponding to a process presented in thedescription of aspects of the present disclosure with a processpresented in the description of aspects of the present disclosure; and

(7) combining one or more processes included in the method implementedby the encoder or the decoder according to Embodiment 1 with a processpresented in the description of aspects of the present disclosure.

Note that the implementation of the processes and/or configurationspresented in the description of aspects of the present disclosure is notlimited to the above examples. For example, the processes and/orconfigurations presented in the description of aspects of the presentdisclosure may be implemented in a device used for a purpose differentfrom the moving picture/picture encoder or the moving picture/picturedecoder disclosed in Embodiment 1. Moreover, the processes and/orconfigurations presented in the description of aspects of the presentdisclosure may be independently implemented. Moreover, processes and/orconfigurations described in different aspects may be combined.

[Encoder Outline]

First, the encoder according to Embodiment 1 will be outlined. FIG. 1 isa block diagram illustrating a functional configuration of encoder 100according to Embodiment 1. Encoder 100 is a moving picture/pictureencoder that encodes a moving picture/picture block by block.

As illustrated in FIG. 1 , encoder 100 is a device that encodes apicture block by block, and includes splitter 102, subtractor 104,transformer 106, quantizer 108, entropy encoder 110, inverse quantizer112, inverse transformer 114, adder 116, block memory 118, loop filter120, frame memory 122, intra predictor 124, inter predictor 126, andprediction controller 128.

Encoder 100 is realized as, for example, a generic processor and memory.In this case, when a software program stored in the memory is executedby the processor, the processor functions as splitter 102, subtractor104, transformer 106, quantizer 108, entropy encoder 110, inversequantizer 112, inverse transformer 114, adder 116, loop filter 120,intra predictor 124, inter predictor 126, and prediction controller 128.Alternatively, encoder 100 may be realized as one or more dedicatedelectronic circuits corresponding to splitter 102, subtractor 104,transformer 106, quantizer 108, entropy encoder 110, inverse quantizer112, inverse transformer 114, adder 116, loop filter 120, intrapredictor 124, inter predictor 126, and prediction controller 128.

Hereinafter, each component included in encoder 100 will be described.

[Splitter]

Splitter 102 splits each picture included in an input moving pictureinto blocks, and outputs each block to subtractor 104. For example,splitter 102 first splits a picture into blocks of a fixed size (forexample, 128×128). The fixed size block is also referred to as codingtree unit (CTU). Splitter 102 then splits each fixed size block intoblocks of variable sizes (for example, 64×64 or smaller), based onrecursive quadtree and/or binary tree block splitting. The variable sizeblock is also referred to as a coding unit (CU), a prediction unit (PU),or a transform unit (TU). Note that in this embodiment, there is no needto differentiate between CU, PU, and TU; all or some of the blocks in apicture may be processed per CU, PU, or TU.

FIG. 2 illustrates one example of block splitting according toEmbodiment 1. In FIG. 2 , the solid lines represent block boundaries ofblocks split by quadtree block splitting, and the dashed lines representblock boundaries of blocks split by binary tree block splitting.

Here, block 10 is a square 128×128 pixel block (128×128 block). This128×128 block 10 is first split into four square 64×64 blocks (quadtreeblock splitting).

The top left 64×64 block is further vertically split into two rectangle32×64 blocks, and the left 32×64 block is further vertically split intotwo rectangle 16×64 blocks (binary tree block splitting). As a result,the top left 64×64 block is split into two 16×64 blocks 11 and 12 andone 32×64 block 13.

The top right 64×64 block is horizontally split into two rectangle 64×32blocks 14 and 15 (binary tree block splitting).

The bottom left 64×64 block is first split into four square 32×32 blocks(quadtree block splitting). The top left block and the bottom rightblock among the four 32×32 blocks are further split. The top left 32×32block is vertically split into two rectangle 16×32 blocks, and the right16×32 block is further horizontally split into two 16×16 blocks (binarytree block splitting). The bottom right 32×32 block is horizontallysplit into two 32×16 blocks (binary tree block splitting). As a result,the bottom left 64×64 block is split into 16×32 block 16, two 16×16blocks 17 and 18, two 32×32 blocks 19 and 20, and two 32×16 blocks 21and 22.

The bottom right 64×64 block 23 is not split.

As described above, in FIG. 2 , block 10 is split into 13 variable sizeblocks 11 through 23 based on recursive quadtree and binary tree blocksplitting. This type of splitting is also referred to as quadtree plusbinary tree (QTBT) splitting.

Note that in FIG. 2 , one block is split into four or two blocks(quadtree or binary tree block splitting), but splitting is not limitedto this example. For example, one block may be split into three blocks(ternary block splitting). Splitting including such ternary blocksplitting is also referred to as multi-type tree (MBT) splitting.

[Subtractor]

Subtractor 104 subtracts a prediction signal (prediction sample) from anoriginal signal (original sample) per block split by splitter 102. Inother words, subtractor 104 calculates prediction errors (also referredto as residuals) of a block to be encoded (hereinafter referred to as acurrent block). Subtractor 104 then outputs the calculated predictionerrors to transformer 106.

The original signal is a signal input into encoder 100, and is a signalrepresenting an image for each picture included in a moving picture (forexample, a luma signal and two chroma signals). Hereinafter, a signalrepresenting an image is also referred to as a sample.

[Transformer]

Transformer 106 transforms spatial domain prediction errors intofrequency domain transform coefficients, and outputs the transformcoefficients to quantizer 108. More specifically, transformer 106applies, for example, a predefined discrete cosine transform (DCT) ordiscrete sine transform (DST) to spatial domain prediction errors.

Note that transformer 106 may adaptively select a transform type fromamong a plurality of transform types, and transform prediction errorsinto transform coefficients by using a transform basis functioncorresponding to the selected transform type. This sort of transform isalso referred to as explicit multiple core transform (EMT) or adaptivemultiple transform (AMT).

The transform types include, for example, DCT-II, DCT-V, DCT-VIII,DST-I, and DST-VII. FIG. 3 is a chart indicating transform basisfunctions for each transform type. In FIG. 3 , N indicates the number ofinput pixels. For example, selection of a transform type from among theplurality of transform types may depend on the prediction type (intraprediction and inter prediction), and may depend on intra predictionmode.

Information indicating whether to apply such EMT or AMT (referred to as,for example, an AMT flag) and information indicating the selectedtransform type is signalled at the CU level. Note that the signaling ofsuch information need not be performed at the CU level, and may beperformed at another level (for example, at the sequence level, picturelevel, slice level, tile level, or CTU level).

Moreover, transformer 106 may apply a secondary transform to thetransform coefficients (transform result). Such a secondary transform isalso referred to as adaptive secondary transform (AST) or non-separablesecondary transform (NSST). For example, transformer 106 applies asecondary transform to each sub-block (for example, each 4×4 sub-block)included in the block of the transform coefficients corresponding to theintra prediction errors. Information indicating whether to apply NSSTand information related to the transform matrix used in NSST aresignalled at the CU level. Note that the signaling of such informationneed not be performed at the CU level, and may be performed at anotherlevel (for example, at the sequence level, picture level, slice level,tile level, or CTU level).

Here, a separable transform is a method in which a transform isperformed a plurality of times by separately performing a transform foreach direction according to the number of dimensions input. Anon-separable transform is a method of performing a collective transformin which two or more dimensions in a multidimensional input arecollectively regarded as a single dimension.

In one example of a non-separable transform, when the input is a 4×4block, the 4×4 block is regarded as a single array including 16components, and the transform applies a 16×16 transform matrix to thearray.

Moreover, similar to above, after an input 4×4 block is regarded as asingle array including 16 components, a transform that performs aplurality of Givens rotations on the array (i.e., a Hypercube-GivensTransform) is also one example of a non-separable transform.

[Quantizer]

Quantizer 108 quantizes the transform coefficients output fromtransformer 106. More specifically, quantizer 108 scans, in apredetermined scanning order, the transform coefficients of the currentblock, and quantizes the scanned transform coefficients based onquantization parameters (QP) corresponding to the transformcoefficients. Quantizer 108 then outputs the quantized transformcoefficients (hereinafter referred to as quantized coefficients) of thecurrent block to entropy encoder 110 and inverse quantizer 112.

A predetermined order is an order for quantizing/inverse quantizingtransform coefficients. For example, a predetermined scanning order isdefined as ascending order of frequency (from low to high frequency) ordescending order of frequency (from high to low frequency).

A quantization parameter is a parameter defining a quantization stepsize (quantization width). For example, if the value of the quantizationparameter increases, the quantization step size also increases. In otherwords, if the value of the quantization parameter increases, thequantization error increases.

[Entropy Encoder]

Entropy encoder 110 generates an encoded signal (encoded bitstream) byvariable length encoding quantized coefficients, which are inputs fromquantizer 108. More specifically, entropy encoder 110, for example,binarizes quantized coefficients and arithmetic encodes the binarysignal.

[Inverse Quantizer]

Inverse quantizer 112 inverse quantizes quantized coefficients, whichare inputs from quantizer 108. More specifically, inverse quantizer 112inverse quantizes, in a predetermined scanning order, quantizedcoefficients of the current block. Inverse quantizer 112 then outputsthe inverse quantized transform coefficients of the current block toinverse transformer 114.

[Inverse Transformer]

Inverse transformer 114 restores prediction errors by inversetransforming transform coefficients, which are inputs from inversequantizer 112. More specifically, inverse transformer 114 restores theprediction errors of the current block by applying an inverse transformcorresponding to the transform applied by transformer 106 on thetransform coefficients. Inverse transformer 114 then outputs therestored prediction errors to adder 116.

Note that since information is lost in quantization, the restoredprediction errors do not match the prediction errors calculated bysubtractor 104. In other words, the restored prediction errors includequantization errors.

[Adder]

Adder 116 reconstructs the current block by summing prediction errors,which are inputs from inverse transformer 114, and prediction samples,which are inputs from prediction controller 128. Adder 116 then outputsthe reconstructed block to block memory 118 and loop filter 120. Areconstructed block is also referred to as a local decoded block.

[Block Memory]

Block memory 118 is storage for storing blocks in a picture to beencoded (hereinafter referred to as a current picture) for reference inintra prediction. More specifically, block memory 118 storesreconstructed blocks output from adder 116.

[Loop Filter]

Loop filter 120 applies a loop filter to blocks reconstructed by adder116, and outputs the filtered reconstructed blocks to frame memory 122.A loop filter is a filter used in an encoding loop (in-loop filter), andincludes, for example, a deblocking filter (DF), a sample adaptiveoffset (SAO), and an adaptive loop filter (ALF).

In ALF, a least square error filter for removing compression artifactsis applied. For example, one filter from among a plurality of filters isselected for each 2×2 sub-block in the current block based on directionand activity of local gradients, and is applied.

More specifically, first, each sub-block (for example, each 2×2sub-block) is categorized into one out of a plurality of classes (forexample, 15 or 25 classes). The classification of the sub-block is basedon gradient directionality and activity. For example, classificationindex C is derived based on gradient directionality D (for example, 0 to2 or 0 to 4) and gradient activity A (for example, 0 to 4) (for example,C=5D+A). Then, based on classification index C, each sub-block iscategorized into one out of a plurality of classes (for example, 15 or25 classes).

For example, gradient directionality D is calculated by comparinggradients of a plurality of directions (for example, the horizontal,vertical, and two diagonal directions). Moreover, for example, gradientactivity A is calculated by summing gradients of a plurality ofdirections and quantizing the sum.

The filter to be used for each sub-block is determined from among theplurality of filters based on the result of such categorization.

The filter shape to be used in ALF is, for example, a circular symmetricfilter shape. FIG. 4A through FIG. 4C illustrate examples of filtershapes used in ALF. FIG. 4A illustrates a 5×5 diamond shape filter, FIG.4B illustrates a 7×7 diamond shape filter, and FIG. 4C illustrates a 9×9diamond shape filter. Information indicating the filter shape issignalled at the picture level. Note that the signaling of informationindicating the filter shape need not be performed at the picture level,and may be performed at another level (for example, at the sequencelevel, slice level, tile level, CTU level, or CU level).

The enabling or disabling of ALF is determined at the picture level orCU level. For example, for luma, the decision to apply ALF or not isdone at the CU level, and for chroma, the decision to apply ALF or notis done at the picture level. Information indicating whether ALF isenabled or disabled is signalled at the picture level or CU level. Notethat the signaling of information indicating whether ALF is enabled ordisabled need not be performed at the picture level or CU level, and maybe performed at another level (for example, at the sequence level, slicelevel, tile level, or CTU level).

The coefficients set for the plurality of selectable filters (forexample, 15 or 25 filters) is signalled at the picture level. Note thatthe signaling of the coefficients set need not be performed at thepicture level, and may be performed at another level (for example, atthe sequence level, slice level, tile level, CTU level, CU level, orsub-block level).

[Frame Memory]

Frame memory 122 is storage for storing reference pictures used in interprediction, and is also referred to as a frame buffer. Morespecifically, frame memory 122 stores reconstructed blocks filtered byloop filter 120.

[Intra Predictor]

Intra predictor 124 generates a prediction signal (intra predictionsignal) by intra predicting the current block with reference to a blockor blocks in the current picture and stored in block memory 118 (alsoreferred to as intra frame prediction). More specifically, intrapredictor 124 generates an intra prediction signal by intra predictionwith reference to samples (for example, luma and/or chroma values) of ablock or blocks neighboring the current block, and then outputs theintra prediction signal to prediction controller 128. For example, intrapredictor 124 performs intra prediction by using one mode from among aplurality of predefined intra prediction modes. The intra predictionmodes include one or more non-directional prediction modes and aplurality of directional prediction modes.

The one or more non-directional prediction modes include, for example,planar prediction mode and DC prediction mode defined in theH.265/high-efficiency video coding (HEVC) standard (see H.265 (ISO/IEC23008-2 HEVC (High Efficiency Video Coding)) (Non-patent Literature(NPL) 1)).

The plurality of directional prediction modes include, for example, the33 directional prediction modes defined in the H.265/HEVC standard. Notethat the plurality of directional prediction modes may further include32 directional prediction modes in addition to the 33 directionalprediction modes (for a total of 65 directional prediction modes). FIG.5A illustrates 67 intra prediction modes used in intra prediction (twonon-directional prediction modes and 65 directional prediction modes).The solid arrows represent the 33 directions defined in the H.265/HEVCstandard, and the dashed arrows represent the additional 32 directions.

Note that a luma block may be referenced in chroma block intraprediction. In other words, a chroma component of the current block maybe predicted based on a luma component of the current block. Such intraprediction is also referred to as cross-component linear model (CCLM)prediction. Such a chroma block intra prediction mode that references aluma block (referred to as, for example, CCLM mode) may be added as oneof the chroma block intra prediction modes.

Intra predictor 124 may correct post-intra-prediction pixel values basedon horizontal/vertical reference pixel gradients. Intra predictionaccompanied by this sort of correcting is also referred to as positiondependent intra prediction combination (PDPC). Information indicatingwhether to apply PDPC or not (referred to as, for example, a PDPC flag)is, for example, signalled at the CU level. Note that the signaling ofthis information need not be performed at the CU level, and may beperformed at another level (for example, at the sequence level, picturelevel, slice level, tile level, or CTU level).

[Inter Predictor]

Inter predictor 126 generates a prediction signal (inter predictionsignal) by inter predicting the current block with reference to a blockor blocks in a reference picture, which is different from the currentpicture and is stored in frame memory 122 (also referred to as interframe prediction). Inter prediction is performed per current block orper sub-block (for example, per 4×4 block) in the current block. Forexample, inter predictor 126 performs motion estimation in a referencepicture for the current block or sub-block. Inter predictor 126 thengenerates an inter prediction signal of the current block or sub-blockby motion compensation by using motion information (for example, amotion vector) obtained from motion estimation. Inter predictor 126 thenoutputs the generated inter prediction signal to prediction controller128.

The motion information used in motion compensation is signalled. Amotion vector predictor may be used for the signaling of the motionvector. In other words, the difference between the motion vector and themotion vector predictor may be signalled.

Note that the inter prediction signal may be generated using motioninformation for a neighboring block in addition to motion informationfor the current block obtained from motion estimation. Morespecifically, the inter prediction signal may be generated per sub-blockin the current block by calculating a weighted sum of a predictionsignal based on motion information obtained from motion estimation and aprediction signal based on motion information for a neighboring block.Such inter prediction (motion compensation) is also referred to asoverlapped block motion compensation (OBMC).

In such an OBMC mode, information indicating sub-block size for OBMC(referred to as, for example, OBMC block size) is signalled at thesequence level. Moreover, information indicating whether to apply theOBMC mode or not (referred to as, for example, an OBMC flag) issignalled at the CU level. Note that the signaling of such informationneed not be performed at the sequence level and CU level, and may beperformed at another level (for example, at the picture level, slicelevel, tile level, CTU level, or sub-block level).

Hereinafter, the OBMC mode will be described in further detail. FIG. 5Bis a flowchart and FIG. 5C is a conceptual diagram for illustrating anoutline of a prediction image correction process performed via OBMCprocessing.

First, a prediction image (Pred) is obtained through typical motioncompensation using a motion vector (MV) assigned to the current block.

Next, a prediction image (Pred_L) is obtained by applying a motionvector (MV_L) of the encoded neighboring left block to the currentblock, and a first pass of the correction of the prediction image ismade by superimposing the prediction image and Pred_L.

Similarly, a prediction image (Pred_U) is obtained by applying a motionvector (MV_U) of the encoded neighboring upper block to the currentblock, and a second pass of the correction of the prediction image ismade by superimposing the prediction image resulting from the first passand Pred_U. The result of the second pass is the final prediction image.

Note that the above example is of a two-pass correction method using theneighboring left and upper blocks, but the method may be a three-pass orhigher correction method that also uses the neighboring right and/orlower block.

Note that the region subjected to superimposition may be the entirepixel region of the block, and, alternatively, may be a partial blockboundary region.

Note that here, the prediction image correction process is described asbeing based on a single reference picture, but the same applies when aprediction image is corrected based on a plurality of referencepictures. In such a case, after corrected prediction images resultingfrom performing correction based on each of the reference pictures areobtained, the obtained corrected prediction images are furthersuperimposed to obtain the final prediction image.

Note that the unit of the current block may be a prediction block and,alternatively, may be a sub-block obtained by further dividing theprediction block.

One example of a method for determining whether to implement OBMCprocessing is by using an obmc_flag, which is a signal that indicateswhether to implement OBMC processing. As one specific example, theencoder determines whether the current block belongs to a regionincluding complicated motion. The encoder sets the obmc_flag to a valueof “1” when the block belongs to a region including complicated motionand implements OBMC processing when encoding, and sets the obmc_flag toa value of “0” when the block does not belong to a region includingcomplication motion and encodes without implementing OBMC processing.The decoder switches between implementing OBMC processing or not bydecoding the obmc_flag written in the stream and performing the decodingin accordance with the flag value.

Note that the motion information may be derived on the decoder sidewithout being signalled. For example, a merge mode defined in theH.265/HEVC standard may be used. Moreover, for example, the motioninformation may be derived by performing motion estimation on thedecoder side. In this case, motion estimation is performed without usingthe pixel values of the current block.

Here, a mode for performing motion estimation on the decoder side willbe described. A mode for performing motion estimation on the decoderside is also referred to as pattern matched motion vector derivation(PMMVD) mode or frame rate up-conversion (FRUC) mode.

One example of FRUC processing is illustrated in FIG. 5D. First, acandidate list (a candidate list may be a merge list) of candidates eachincluding a motion vector predictor is generated with reference tomotion vectors of encoded blocks that spatially or temporally neighborthe current block. Next, the best candidate MV is selected from among aplurality of candidate MVs registered in the candidate list. Forexample, evaluation values for the candidates included in the candidatelist are calculated and one candidate is selected based on thecalculated evaluation values.

Next, a motion vector for the current block is derived from the motionvector of the selected candidate. More specifically, for example, themotion vector for the current block is calculated as the motion vectorof the selected candidate (best candidate MV), as-is. Alternatively, themotion vector for the current block may be derived by pattern matchingperformed in the vicinity of a position in a reference picturecorresponding to the motion vector of the selected candidate. In otherwords, when the vicinity of the best candidate MV is searched via thesame method and an MV having a better evaluation value is found, thebest candidate MV may be updated to the MV having the better evaluationvalue, and the MV having the better evaluation value may be used as thefinal MV for the current block. Note that a configuration in which thisprocessing is not implemented is also acceptable.

The same processes may be performed in cases in which the processing isperformed in units of sub-blocks.

Note that an evaluation value is calculated by calculating thedifference in the reconstructed image by pattern matching performedbetween a region in a reference picture corresponding to a motion vectorand a predetermined region. Note that the evaluation value may becalculated by using some other information in addition to thedifference.

The pattern matching used is either first pattern matching or secondpattern matching. First pattern matching and second pattern matching arealso referred to as bilateral matching and template matching,respectively.

In the first pattern matching, pattern matching is performed between twoblocks along the motion trajectory of the current block in two differentreference pictures. Therefore, in the first pattern matching, a regionin another reference picture conforming to the motion trajectory of thecurrent block is used as the predetermined region for theabove-described calculation of the candidate evaluation value.

FIG. 6 is for illustrating one example of pattern matching (bilateralmatching) between two blocks along a motion trajectory. As illustratedin FIG. 6 , in the first pattern matching, two motion vectors (MV0, MV1)are derived by finding the best match between two blocks along themotion trajectory of the current block (Cur block) in two differentreference pictures (Ref0, Ref1). More specifically, a difference between(i) a reconstructed image in a specified position in a first encodedreference picture (Ref0) specified by a candidate MV and (ii) areconstructed picture in a specified position in a second encodedreference picture (Ref1) specified by a symmetrical MV scaled at adisplay time interval of the candidate MV may be derived, and theevaluation value for the current block may be calculated by using thederived difference. The candidate MV having the best evaluation valueamong the plurality of candidate MVs may be selected as the final MV.

Under the assumption of continuous motion trajectory, the motion vectors(MV0, MV1) pointing to the two reference blocks shall be proportional tothe temporal distances (TD0, TD1) between the current picture (Cur Pic)and the two reference pictures (Ref0, Ref1). For example, when thecurrent picture is temporally between the two reference pictures and thetemporal distance from the current picture to the two reference picturesis the same, the first pattern matching derives a mirror basedbi-directional motion vector.

In the second pattern matching, pattern matching is performed between atemplate in the current picture (blocks neighboring the current block inthe current picture (for example, the top and/or left neighboringblocks)) and a block in a reference picture. Therefore, in the secondpattern matching, a block neighboring the current block in the currentpicture is used as the predetermined region for the above-describedcalculation of the candidate evaluation value.

FIG. 7 is for illustrating one example of pattern matching (templatematching) between a template in the current picture and a block in areference picture. As illustrated in FIG. 7 , in the second patternmatching, a motion vector of the current block is derived by searching areference picture (Ref0) to find the block that best matches neighboringblocks of the current block (Cur block) in the current picture (CurPic). More specifically, a difference between (i) a reconstructed imageof an encoded region that is both or one of the neighboring left andneighboring upper regions and (ii) a reconstructed picture in the sameposition in an encoded reference picture (Ref0) specified by a candidateMV may be derived, and the evaluation value for the current block may becalculated by using the derived difference. The candidate MV having thebest evaluation value among the plurality of candidate MVs may beselected as the best candidate MV.

Information indicating whether to apply the FRUC mode or not (referredto as, for example, a FRUC flag) is signalled at the CU level.

Moreover, when the FRUC mode is applied (for example, when the FRUC flagis set to true), information indicating the pattern matching method(first pattern matching or second pattern matching) is signalled at theCU level. Note that the signaling of such information need not beperformed at the CU level, and may be performed at another level (forexample, at the sequence level, picture level, slice level, tile level,CTU level, or sub-block level).

Here, a mode for deriving a motion vector based on a model assuminguniform linear motion will be described. This mode is also referred toas a bi-directional optical flow (BIO) mode.

FIG. 8 is for illustrating a model assuming uniform linear motion. InFIG. 8 , (v_(x), v_(y)) denotes a velocity vector, and τ₀ and τ₁ denotetemporal distances between the current picture (Cur Pic) and tworeference pictures (Ref₀, Ref₁). (MVx₀, MVy₀) denotes a motion vectorcorresponding to reference picture Ref₀, and (MVx₁, MVy₁) denotes amotion vector corresponding to reference picture Ref₁.

Here, under the assumption of uniform linear motion exhibited byvelocity vector (v_(x), v_(y)), (MVx₀, MVy₀) and (MVx₁, MVy₁) arerepresented as (v^(x)τ₀, v_(y)τ₀) and (−v_(x)τ₁, −v_(y)τ₁),respectively, and the following optical flow equation is given.

MATH.1 $\begin{matrix}{{{{\partial I^{(k)}}/{\partial t}} + {v_{x}{{\partial I^{(k)}}/{\partial x}}} + {v_{y}{{\partial I^{(k)}}/{\partial y}}}} = 0.} & (1)\end{matrix}$

Here, I^((k)) denotes a luma value from reference picture k (k=0, 1)after motion compensation. This optical flow equation shows that the sumof (i) the time derivative of the luma value, (ii) the product of thehorizontal velocity and the horizontal component of the spatial gradientof a reference picture, and (iii) the product of the vertical velocityand the vertical component of the spatial gradient of a referencepicture is equal to zero. A motion vector of each block obtained from,for example, a merge list is corrected pixel by pixel based on acombination of the optical flow equation and Hermite interpolation.

Note that a motion vector may be derived on the decoder side using amethod other than deriving a motion vector based on a model assuminguniform linear motion. For example, a motion vector may be derived foreach sub-block based on motion vectors of neighboring blocks.

Here, a mode in which a motion vector is derived for each sub-blockbased on motion vectors of neighboring blocks will be described. Thismode is also referred to as affine motion compensation prediction mode.

FIG. 9A is for illustrating deriving a motion vector of each sub-blockbased on motion vectors of neighboring blocks. In FIG. 9A, the currentblock includes 16 4×4 sub-blocks. Here, motion vector v₀ of the top leftcorner control point in the current block is derived based on motionvectors of neighboring sub-blocks, and motion vector v₁ of the top rightcorner control point in the current block is derived based on motionvectors of neighboring blocks. Then, using the two motion vectors v₀ andv₁, the motion vector (v_(x), v_(y)) of each sub-block in the currentblock is derived using Equation 2 below.

MATH.2 $\begin{matrix}\left\{ \begin{matrix}{v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{1y} - v_{0y}} \right)}{w}y} + v_{0x}}} \\{v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} + {\frac{\left( {v_{1x} - v_{0x}} \right)}{w}y} + v_{0y}}}\end{matrix} \right. & (2)\end{matrix}$

Here, x and y are the horizontal and vertical positions of thesub-block, respectively, and w is a predetermined weighted coefficient.

Such an affine motion compensation prediction mode may include a numberof modes of different methods of deriving the motion vectors of the topleft and top right corner control points. Information indicating such anaffine motion compensation prediction mode (referred to as, for example,an affine flag) is signalled at the CU level. Note that the signaling ofinformation indicating the affine motion compensation prediction modeneed not be performed at the CU level, and may be performed at anotherlevel (for example, at the sequence level, picture level, slice level,tile level, CTU level, or sub-block level).

[Prediction Controller]

Prediction controller 128 selects either the intra prediction signal orthe inter prediction signal, and outputs the selected prediction signalto subtractor 104 and adder 116.

Here, an example of deriving a motion vector via merge mode in a currentpicture will be given. FIG. 9B is for illustrating an outline of aprocess for deriving a motion vector via merge mode.

First, an MV predictor list in which candidate MV predictors areregistered is generated. Examples of candidate MV predictors include:spatially neighboring MV predictors, which are MVs of encoded blockspositioned in the spatial vicinity of the current block; a temporallyneighboring MV predictor, which is an MV of a block in an encodedreference picture that neighbors a block in the same location as thecurrent block; a combined MV predictor, which is an MV generated bycombining the MV values of the spatially neighboring MV predictor andthe temporally neighboring MV predictor; and a zero MV predictor, whichis an MV whose value is zero.

Next, the MV of the current block is determined by selecting one MVpredictor from among the plurality of MV predictors registered in the MVpredictor list.

Furthermore, in the variable-length encoder, a merge_idx, which is asignal indicating which MV predictor is selected, is written and encodedinto the stream.

Note that the MV predictors registered in the MV predictor listillustrated in FIG. 9B constitute one example. The number of MVpredictors registered in the MV predictor list may be different from thenumber illustrated in FIG. 9B, the MV predictors registered in the MVpredictor list may omit one or more of the types of MV predictors givenin the example in FIG. 9B, and the MV predictors registered in the MVpredictor list may include one or more types of MV predictors inaddition to and different from the types given in the example in FIG.9B.

Note that the final MV may be determined by performing DMVR processing(to be described later) by using the MV of the current block derived viamerge mode.

Here, an example of determining an MV by using DMVR processing will begiven.

FIG. 9C is a conceptual diagram for illustrating an outline of DMVRprocessing.

First, the most appropriate MVP set for the current block is consideredto be the candidate MV, reference pixels are obtained from a firstreference picture, which is a picture processed in the LO direction inaccordance with the candidate MV, and a second reference picture, whichis a picture processed in the Li direction in accordance with thecandidate MV, and a template is generated by calculating the average ofthe reference pixels.

Next, using the template, the surrounding regions of the candidate MVsof the first and second reference pictures are searched, and the MV withthe lowest cost is determined to be the final MV. Note that the costvalue is calculated using, for example, the difference between eachpixel value in the template and each pixel value in the regionssearched, as well as the MV value.

Note that the outlines of the processes described here are fundamentallythe same in both the encoder and the decoder.

Note that processing other than the processing exactly as describedabove may be used, so long as the processing is capable of deriving thefinal MV by searching the surroundings of the candidate MV.

Here, an example of a mode that generates a prediction image by usingLIC processing will be given.

FIG. 9D is for illustrating an outline of a prediction image generationmethod using a luminance correction process performed via LICprocessing.

First, an MV is extracted for obtaining, from an encoded referencepicture, a reference image corresponding to the current block.

Next, information indicating how the luminance value changed between thereference picture and the current picture is extracted and a luminancecorrection parameter is calculated by using the luminance pixel valuesfor the encoded left neighboring reference region and the encoded upperneighboring reference region, and the luminance pixel value in the samelocation in the reference picture specified by the MV.

The prediction image for the current block is generated by performing aluminance correction process by using the luminance correction parameteron the reference image in the reference picture specified by the MV.

Note that the shape of the surrounding reference region illustrated inFIG. 9D is just one example; the surrounding reference region may have adifferent shape.

Moreover, although a prediction image is generated from a singlereference picture in this example, in cases in which a prediction imageis generated from a plurality of reference pictures as well, theprediction image is generated after performing a luminance correctionprocess, via the same method, on the reference images obtained from thereference pictures.

One example of a method for determining whether to implement LICprocessing is by using an lic_flag, which is a signal that indicateswhether to implement LIC processing. As one specific example, theencoder determines whether the current block belongs to a region ofluminance change. The encoder sets the lic_flag to a value of “1” whenthe block belongs to a region of luminance change and implements LICprocessing when encoding, and sets the lic_flag to a value of “0” whenthe block does not belong to a region of luminance change and encodeswithout implementing LIC processing. The decoder switches betweenimplementing LIC processing or not by decoding the lic_flag written inthe stream and performing the decoding in accordance with the flagvalue.

One example of a different method of determining whether to implementLIC processing is determining so in accordance with whether LICprocessing was determined to be implemented for a surrounding block. Inone specific example, when merge mode is used on the current block,whether LIC processing was applied in the encoding of the surroundingencoded block selected upon deriving the MV in the merge mode processingmay be determined, and whether to implement LIC processing or not can beswitched based on the result of the determination. Note that in thisexample, the same applies to the processing performed on the decoderside.

[Decoder Outline]

Next, a decoder capable of decoding an encoded signal (encodedbitstream) output from encoder 100 will be described. FIG. 10 is a blockdiagram illustrating a functional configuration of decoder 200 accordingto Embodiment 1. Decoder 200 is a moving picture/picture decoder thatdecodes a moving picture/picture block by block.

As illustrated in FIG. 10 , decoder 200 includes entropy decoder 202,inverse quantizer 204, inverse transformer 206, adder 208, block memory210, loop filter 212, frame memory 214, intra predictor 216, interpredictor 218, and prediction controller 220.

Decoder 200 is realized as, for example, a generic processor and memory.In this case, when a software program stored in the memory is executedby the processor, the processor functions as entropy decoder 202,inverse quantizer 204, inverse transformer 206, adder 208, loop filter212, intra predictor 216, inter predictor 218, and prediction controller220. Alternatively, decoder 200 may be realized as one or more dedicatedelectronic circuits corresponding to entropy decoder 202, inversequantizer 204, inverse transformer 206, adder 208, loop filter 212,intra predictor 216, inter predictor 218, and prediction controller 220.

Hereinafter, each component included in decoder 200 will be described.

[Entropy Decoder]

Entropy decoder 202 entropy decodes an encoded bitstream. Morespecifically, for example, entropy decoder 202 arithmetic decodes anencoded bitstream into a binary signal. Entropy decoder 202 thendebinarizes the binary signal. With this, entropy decoder 202 outputsquantized coefficients of each block to inverse quantizer 204.

[Inverse Quantizer]

Inverse quantizer 204 inverse quantizes quantized coefficients of ablock to be decoded (hereinafter referred to as a current block), whichare inputs from entropy decoder 202. More specifically, inversequantizer 204 inverse quantizes quantized coefficients of the currentblock based on quantization parameters corresponding to the quantizedcoefficients. Inverse quantizer 204 then outputs the inverse quantizedcoefficients (i.e., transform coefficients) of the current block toinverse transformer 206.

[Inverse Transformer]

Inverse transformer 206 restores prediction errors by inversetransforming transform coefficients, which are inputs from inversequantizer 204.

For example, when information parsed from an encoded bitstream indicatesapplication of EMT or AMT (for example, when the AMT flag is set totrue), inverse transformer 206 inverse transforms the transformcoefficients of the current block based on information indicating theparsed transform type.

Moreover, for example, when information parsed from an encoded bitstreamindicates application of NSST, inverse transformer 206 applies asecondary inverse transform to the transform coefficients.

[Adder]

Adder 208 reconstructs the current block by summing prediction errors,which are inputs from inverse transformer 206, and prediction samples,which is an input from prediction controller 220. Adder 208 then outputsthe reconstructed block to block memory 210 and loop filter 212.

[Block Memory]

Block memory 210 is storage for storing blocks in a picture to bedecoded (hereinafter referred to as a current picture) for reference inintra prediction. More specifically, block memory 210 storesreconstructed blocks output from adder 208.

[Loop Filter]

Loop filter 212 applies a loop filter to blocks reconstructed by adder208, and outputs the filtered reconstructed blocks to frame memory 214and, for example, a display device.

When information indicating the enabling or disabling of ALF parsed froman encoded bitstream indicates enabled, one filter from among aplurality of filters is selected based on direction and activity oflocal gradients, and the selected filter is applied to the reconstructedblock.

[Frame Memory]

Frame memory 214 is storage for storing reference pictures used in interprediction, and is also referred to as a frame buffer. Morespecifically, frame memory 214 stores reconstructed blocks filtered byloop filter 212.

[Intra Predictor]

Intra predictor 216 generates a prediction signal (intra predictionsignal) by intra prediction with reference to a block or blocks in thecurrent picture and stored in block memory 210, based on the intraprediction mode parsed from the encoded bitstream. More specifically,intra predictor 216 generates an intra prediction signal by intraprediction with reference to samples (for example, luma and/or chromavalues) of a block or blocks neighboring the current block, and thenoutputs the intra prediction signal to prediction controller 220.

Note that when an intra prediction mode in which a chroma block is intrapredicted from a luma block is selected, intra predictor 216 may predictthe chroma component of the current block based on the luma component ofthe current block.

Moreover, when information indicating the application of PDPC is parsedfrom an encoded bitstream, intra predictor 216 correctspost-intra-prediction pixel values based on horizontal/verticalreference pixel gradients.

[Inter Predictor]

Inter predictor 218 predicts the current block with reference to areference picture stored in frame memory 214. Inter prediction isperformed per current block or per sub-block (for example, per 4×4block) in the current block. For example, inter predictor 218 generatesan inter prediction signal of the current block or sub-block by motioncompensation by using motion information (for example, a motion vector)parsed from an encoded bitstream, and outputs the inter predictionsignal to prediction controller 220.

Note that when the information parsed from the encoded bitstreamindicates application of OBMC mode, inter predictor 218 generates theinter prediction signal using motion information for a neighboring blockin addition to motion information for the current block obtained frommotion estimation.

Moreover, when the information parsed from the encoded bitstreamindicates application of FRUC mode, inter predictor 218 derives motioninformation by performing motion estimation in accordance with thepattern matching method (bilateral matching or template matching) parsedfrom the encoded bitstream. Inter predictor 218 then performs motioncompensation using the derived motion information.

Moreover, when BIO mode is to be applied, inter predictor 218 derives amotion vector based on a model assuming uniform linear motion. Moreover,when the information parsed from the encoded bitstream indicates thataffine motion compensation prediction mode is to be applied, interpredictor 218 derives a motion vector of each sub-block based on motionvectors of neighboring blocks.

[Prediction Controller]

Prediction controller 220 selects either the intra prediction signal orthe inter prediction signal, and outputs the selected prediction signalto adder 208.

Next, each aspect of block splitting performed by such encoder 100 ordecoder 200 will be described with reference to the drawings.Hereinafter, a current block to be encoded or decoded is simply referredto as block.

[First Aspect]

FIG. 11 illustrates an encoding method and an encoding process performedby an encoder according to the first aspect.

At step S1001, a first cost is calculated from a first block codingprocess. The first block coding process does not include partitioning ablock into a plurality of partitions, and a cost includes a distortion.The cost can be obtained, for example, by adding a value indicatingcoding distortion to a value obtained by multiplying, with a Lagrangemultiplier, a value indicating the encoding load generated. The codingdistortion can be obtained based on, for example, a sum of absolutedifference between a locally decoded image and an original image.

At step S1002, a second cost is calculated from a second block codingprocess. The second block coding process includes a step of firstlypartitioning a block two smaller partitions.

At step S1003, whether the first cost is lower than the second cost isdetermined.

At step S1004, when it is determined that the first cost is lower thanthe second cost, a block coding process is selected from a second set ofblock coding processes. The second set of block coding processes doesnot include a third block coding process including a step of firstlypartitioning a block into three smaller partitions.

FIG. 12 illustrates that when it is determined that the first cost islower than all of the second costs, the second set of block codingprocesses excludes the third block coding process including the step offirstly partitioning a block into three smaller partitions. The secondset of block coding processes is a sub set of a first set of blockcoding processes.

Specifically, in FIG. 12 , when it is determined that the first cost isnot lower than one of the second costs, a block coding process isselected from the first set of block coding processes including thethird block coding process. In contrast, when it is determined that thefirst cost is lower than all of the second costs, a block coding processis selected from the second set of block coding processes obtained byexcluding the third block coding process from the first set of blockcoding processes.

FIG. 13 illustrates other examples of the first costs having differentbinary tree depths. In the upper example, cost calculation is performedfor a left partition obtained by partitioning a block into twopartitions in a vertical direction. In the lower example, costcalculation is performed for an upper sub partition obtained bypartitioning a block first into two partitions in a horizontal directionand then partitioning the upper partition into two sub partitions in thehorizontal direction. In either of the examples, when it is determinedthat the first cost is lower than all of the second costs, the secondset of block coding processes excludes the third block coding processhaving the step of firstly partitioning a block into three smallerpartitions. The second set of block coding processes is a sub set of thefirst set of block coding processes.

At step S1005, when it is determined that the first cost is not lowerthan the second cost, a block coding process is selected from the firstset of block coding processes. The first set of block coding processesincludes at least the third block coding process.

At step S1006, a block is coded using the selected block coding process.

Advantageous Effects of First Aspect

The present aspect reduces the total number of partition structurecandidates at an encoder side and thus reduces encoding complexity.

[Combination with Other Aspects]

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe processes in the flowcharts, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

[Second Aspect]

FIG. 14 illustrates an encoding method and an encoding process performedby an encoder according to the second aspect.

At step S2001, a first cost is calculated from a first block codingprocess. The first block coding process includes a step of partitioninga block into two smaller partitions only. In other words, in the firstblock coding process, the block is partitioned into two partitions andeach of the partitions is not to be partitioned any further.

At step S2002, a second cost is calculated from a second block codingprocess. The second block coding process includes a step of firstlypartitioning a block into two smaller partitions and the subsequentsteps of partitioning into three or more partitions.

Step S2003 is the same as step S1003.

Step S2004 is the same as step S1004.

FIG. 15 illustrates that when it is determined that either one of thefirst costs is lower than all of the second costs, a block codingprocess is selected from a second set of block coding processes. Thesecond set of block coding processes excludes a third block codingprocess including a step of firstly partitioning a block into threesmaller partitions.

The second set of block coding processes is a sub set of a first set ofblock coding processes. In other words, the second set of block codingprocesses is obtained by excluding a predetermined coding process fromthe first set of block coding processes. The predetermined codingprocess includes at least the third block coding process.

Step S2005 is the same as step S1005.

Step S2006 is the same as step S1006.

Advantageous Effects of Second Aspect

The present aspect reduces the total number of partition structurecandidates at an encoder side and thus reduces encoding complexity.

[Combination with Other Aspects]

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe processes in the flowcharts, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

[Third Aspect]

FIG. 16 illustrates an encoding method and an encoding process performedby an encoder according to the third aspect.

At step S3001, at least a first gradient of a rectangular block iscalculated in a first direction parallel to the longer side of therectangular block. The calculation of the gradient includes at least adirectional change in intensity or color.

At step S3002, at least a second gradient of the rectangular block iscalculated in a second direction. The second direction is different fromthe first direction.

At step S3003, whether the first gradient is greater than the secondgradient is determined.

At step S3004, when it is determined that the first gradient is greaterthan the second gradient, a block coding process is selected from asecond set of block coding processes. The second set of block codingprocesses does not include at least a first block coding processincluding a step of firstly partitioning a block into three smallerpartitions in the first direction.

The second set of block coding processes is a sub set of a first set ofblock coding processes. In other words, the second set of block codingprocesses is obtained by excluding a predetermined coding process fromthe first set of block coding processes. The predetermined codingprocess includes at least the first block coding process.

FIG. 17 illustrates that when a vertical gradient of a rectangular blockwhose height is greater than its width is greater than its horizontal ordiagonal gradient, a second set of block coding processes excludes afirst block coding process including a step of firstly partitioning ablock into three smaller partitions in a vertical direction. In otherwords, when the vertical gradient is greater than the horizontal ordiagonal gradient, a block coding process is selected from the secondset of block coding processes from which the first block coding processhas been excluded. On the contrary, when the vertical gradient is notgreater than the horizontal or diagonal gradient, a block coding processis selected from the first set of block coding processes including thefirst block coding process.

FIG. 18 illustrates that when a horizontal gradient of a rectangularblock whose width is greater than its height is greater than itsvertical or diagonal gradient, a second set of block coding processesexcludes a first block coding process including a step of firstlypartitioning a block into three smaller partitions in a horizontaldirection. In other words, when the horizontal gradient is greater thanthe vertical or diagonal gradient, a block coding process is selectedfrom the second set of block coding processes from which the first blockcoding process has been excluded. On the contrary, when the horizontalgradient is not greater than the vertical or diagonal gradient, a blockcoding process is selected from the first set of block coding processesincluding the first block coding process.

FIGS. 19A and 19B illustrate examples of calculation of a change inpixel intensity in a horizontal direction. A horizontal gradient iscalculation related to a change in intensity or color in the horizontaldirection. Similarly, a vertical gradient can be calculated based on achange in intensity or color in a vertical direction. Similarly, adiagonal gradient can be calculated based on a change in intensity orcolor in a diagonal direction.

Specifically, in the example illustrated in FIG. 19A, an absolutedifference between two pixels neighboring in a pixel row in thehorizontal direction is firstly calculated. For example, absolutedifference h1_12=abs(p1, p2), h1_23, h1_34 is calculated in the firstrow. Then, an average absolute difference (e.g., average absolutedifference H1=average (h1_12+h1_23+h1_34 in the first row) is calculatedfor each pixel row. By calculating an average of average absolutedifference in plural pixel columns thus calculated (average(H1+H2+H3+H4)), a horizontal gradient is calculated.

In the example illustrated in FIG. 19B, a one-dimensional filter isapplied to three pixels neighboring in a pixel row in the horizontaldirection. For example, h1_123 (=2×p2−p1−p3) and h1_234 are calculatedusing filter coefficients (−1, 2, −1). Then, an average of the filteredvalues (e.g., H1=average (h1_123+h1_234 in the first row)) is calculatedfor each pixel row. Furthermore, by calculating an average of averagevalues calculated for plural pixel rows (average (H1+H2+H3+H4)), ahorizontal gradient is calculated.

The first gradient and the second gradient are not limited to verticalor horizontal gradients. They can include a gradient in other directionsuch as a diagonal direction or a gradient in a different direction. Thegradient calculation described in FIG. 19A or 19B is just an example andany other method for gradient calculation may be applied.

At step S3005, when it is determined that the first gradient is notgreater than the second gradient, a block coding process is selectedfrom the first set of block coding processes. The first set of blockcoding processes includes the first block coding process.

At step S3006, the block is encoded using the selected block codingprocess.

Advantageous Effects of Third Aspect

The present aspect reduces the total number of partition structurecandidates at an encoder side and thus reduces encoding complexity.

[Combination with Other Aspects]

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe processes in the flowcharts, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

[Fourth Aspect]

FIG. 20 illustrates an encoding method and an encoding process performedby an encoder according to the fourth aspect.

At step S4001, whether a step of partitioning a block in a first blockcoding process generates a partition having half the size of the blockis determined.

At step S4002, when it is determined that the step of partitioning ablock in the first block coding process generates a partition havinghalf the size of the block, at least a gradient of the block iscalculated.

At step S4003, a second set of block coding processes is generated froma first set of block coding processes by excluding therefrom at least ablock coding process that uses gradient information. The block codingprocess excluded here includes at least a step of firstly partitioning ablock into three smaller partitions.

At step S4004, a block coding process is selected from the second set ofblock coding processes.

(a) in FIG. 21 illustrates that when the block coding process generatesan area of a sub partition which is half the area of the block and ahorizontal gradient is greater than a vertical gradient, a block codingprocess is selected from the second set of block coding processes. Thesecond set of block coding processes excludes a process of coding ablock having a plurality of partitions and a step of firstlypartitioning a block into three smaller partitions in a horizontaldirection.

(b) in FIG. 21 illustrates that when the block coding process generatesan area of a sub partition which is half the area of the block and avertical gradient is greater than a horizontal gradient, a block codingprocess is selected from the second set of block coding processes. Thesecond set of block coding processes excludes the process of coding ablock having a plurality of partitions and the step of firstlypartitioning a block into three smaller partitions in the horizontaldirection.

At step S4005, when it is determined that the step of partitioning ablock in the first block coding process does not generate a partitionhaving half the size of the block, a block coding process is selectedfrom the first set of block coding processes.

At step S4006, the block is coded using the selected block codingprocess.

Advantageous Effects of Fourth Aspect

The present aspect reduces the total number of partition structurecandidates at an encoder side and thus reduces encoding complexity.

[Combination with Other Aspects]

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe processes in the flowcharts, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

[Fifth Aspect]

FIG. 22 illustrates an encoding method and an encoding process performedby an encoder according to the fifth aspect.

At step S5001, a first side of a block is identified as the longer sideout of the two sides of the block and a second side of the block isidentified as a side that is not the longer side of the block.

At step S5002, when the block is to be split into at least three smallerpartitions, it is determined whether splitting the block in a directionparallel to the first side generates at least a partition having a sizenot supported in a prediction process or a transform process.

At step S5003, when it is determined that splitting the block in thedirection parallel to the first side generates at least a partitionhaving a size not supported in a prediction process or a transformprocess, the block is split into smaller partitions in a directionparallel to the second side. FIG. 23A illustrates an example ofsplitting a 16×8 block into three smaller partitions in a directionparallel to the height of the 16×8 block (vertical direction) whentransform is not implemented for 16×2. FIG. 23B illustrates an exampleof splitting a 16×8 block into four smaller partitions in a directionparallel to the height of the 16×8 block (vertical direction) whentransform is not implemented for 16×2. The size 16×2 is obtained bysplitting the block in a direction parallel to the width of the block.In other words, in FIGS. 23A and 23B, it is not allowed to split theblock into three or four in a horizontal direction parallel to the firstside (longer side).

At step S5004, when it is not determined that splitting the block in thedirection parallel to the first side generates at least a partitionhaving a size not supported in a prediction process or a transformprocess, a split direction parameter is written into a bitstream. Thesplit direction parameter may indicate a direction in which a block isto be split and indicate a horizontal or vertical direction. Thelocation of a split direction parameter is illustrated in FIG. 31 .

At step S5005, the block is split into smaller partitions in a directionindicated by the split direction parameter.

At step S5006, a partition or a sub partition of the partition isencoded.

It should be noted that the terms “write” and “into (a bitstream)” atstep S5004 and the term “encode” at step S5006 for the encoding methodand the encoding process performed by an encoder may be respectivelyreplaced with the terms “parse”, “from (the bitstream)”, and “decode”for a decoding method and a decoding process performed by a decoder.

Advantageous Effects of Fifth Aspect

According to the present aspect, there is no need to encode a splitdirection at some specific block sizes, and this improves codingefficiency. The present disclosure also reduces the total number ofpartition structure candidates at an encoder side and thus reducesencoding complexity.

[Combination with Other Aspects]

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe processes in the flowcharts, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

[Sixth Aspect]

FIG. 24 illustrates an encoding method and an encoding process performedby an encoder according to the sixth aspect.

At step S6001, it is determined whether splitting a block into threesmaller partitions in each direction of a plurality of directionsgenerates at least a partition having a size not supported in aprediction process or a transform process.

At step S6002, when it is determined that splitting the block into threesmaller partitions in each direction of the plurality of directionsgenerates at least a partition having a size not supported in aprediction process or a transform process, the block is split into twosmaller partitions in one direction.

At step S6003, when it is determined that splitting the block into threesmaller partitions at least in one direction among a plurality ofdirections does not generate at least a partition having a size notsupported in a prediction process or a transform process, a parameter iswritten into the bitstream. The parameter indicates the number ofsmaller partitions obtained by splitting a block. The parameter may be asplit mode parameter. The split mode parameter may indicate the numberof sub blocks having a predetermined split ratio for splitting a block.The split mode parameter may indicate at least the number of partitionsinto which a block is to be split. The location of a split modeparameter is illustrated in FIG. 31 .

At step S6004, the block is split into several partitions in onedirection according to the parameter. The number of the partitions maybe 2 or 3.

Step S6005 is the same as step S5006.

FIG. 25A illustrates examples of a candidate for a partition structurefor splitting a 16×16 block. FIG. 25B illustrates examples of acandidate for a partition structure for splitting an 8×8 block. Thereare four candidates for the partition structure for splitting the 16×16block, as illustrated in FIG. 25A. There are two candidates for thepartition structure for splitting the 8×8 block, as illustrated in FIG.25B. In the examples, a partition structure of splitting the 8×8 blockinto three smaller partitions along a horizontal or vertical directionis removed from the partition structure candidates since 8×2 and 2×8 arenot supported in a transform process. In other words, it is not allowedto split the 8×8 block into three sub blocks because 8×2 and 2×8 sizesare not supported in a transform process.

It should be noted that the terms “write” and “into (a bitstream)” atstep S6003 and the term “encode” at step S6005 for the encoding methodand the encoding process performed by an encoder may be respectivelyreplaced with the terms “parse”, “from (the bitstream)”, and “decode”for a decoding method and a decoding process performed by a decoder.

Advantageous Effects of Sixth Aspect

According to the present aspect, there is no need to encode a splitdirection at some specific block sizes, and this improves codingefficiency. The present disclosure also reduces the total number ofpartition structure candidates at an encoder side and thus reducesencoding complexity.

[Combination with Other Aspects]

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe processes in the flowcharts, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

[Seventh Aspect]

FIG. 26 illustrates an encoding method and an encoding process performedby an encoder according to the seventh aspect.

At step S7001, a block is split into first, second, and third sub blocksin a first direction. According to the present aspect, the split ratioof ternary split is 1:2:1 as illustrated in FIG. 30 . Accordingly, thesecond sub block located between the first sub block and the third subblock is larger in size than the first and third sub blocks. It shouldbe noted that the index values of 0 to 2 may be sequentially assigned tothe first through third sub blocks.

At step S7002, when the second sub block is to be split into a pluralityof partitions, a split mode parameter is written into a bitstream toindicate the number of partitions. The split mode parameter may indicatethe number of sub blocks having a predetermined split ratio forsplitting a block, as illustrated in FIG. 30 . The split mode parametermay indicate only the number of sub blocks. The split mode parameter mayindicate, along with the number of sub blocks, information differentfrom a split ratio. The location of a split mode parameter isillustrated in FIG. 31 .

At step S7003, whether the split mode parameter indicates that thenumber of partitions is two is determined.

At step S7004, when it is determined that the split mode parameterindicates that the number of partitions is two, the second sub block issplit into two partitions in a second direction different from the firstdirection. In other words, it is prohibited to split the second subblock into two partitions in the first direction. This is why a splitdirection parameter is not written into a bitstream. Namely, writing asplit direction parameter into the bitstream is omitted (i.e., skipped).

FIG. 27 illustrates examples of a way to split a 32×32 block. In (a), a32×32 block is split first into two sub blocks in a vertical direction,and then each of the sub blocks is split into two partitions in thevertical direction. In (b), a 32×32 block is split first into three subblocks in the vertical direction, and then the largest sub block issplit into two partitions. A split direction for splitting the largestsub block is set so to be parallel to the shorter side of a 16×32 block.In other words, splitting the largest sub block into two partitions in ahorizontal direction is allowed, but splitting in the vertical directionis not allowed. The largest sub block is equivalent to the second subblock. This inhibits the occurrence of the same partition structure(also referred to as repeated partition structure) in the mutuallydifferent splitting ways illustrated in (a) and (b).

At step S7005, when it is not determined that the split mode parameterindicates that the number of partitions is two, a split directionparameter is written into the bitstream. The split direction parametermay indicate the split direction of a block, and indicate a horizontalor vertical direction as illustrated in FIG. 30 . The location of asplit direction parameter is illustrated in FIG. 31

At step S7006, the second sub block is split into at least three smallerpartitions in a direction indicated by the split direction parameter.

Step S7007 is the same as step S5006.

It should be noted that the terms “write” and “into (a bitstream)” atstep S6003 and the term “encode” at step S6005 for the encoding methodand the encoding process performed by an encoder may be respectivelyreplaced with the terms “parse”, “from (the bitstream)”, and “decode”for a decoding method and a decoding process performed by a decoder.

Note that the steps and the order of the steps are just examples as hasbeen described above, and are not limited to such. The order of thesteps may be changed as can be conceived by a person skilled in the artas long as it does not go beyond the scope of the present disclosure. InFIG. 26 , for example, a split direction parameter may be written into abitstream ahead of a split mode parameter. In other words, in FIG. 31 ,the location of a split mode parameter may be replaced with the locationof a split direction parameter. In FIG. 26 , step S7002 may be replacedwith step S7005.

In this case, when the second sub block is to be split into a pluralityof partitions, a split direction parameter is firstly written into abitstream. Subsequently, whether the split direction parameter indicatesa first direction is determined. When the split direction parameterindicates the first direction, the second sub block is split into threepartitions in the first direction. In other words, it is prohibited tosplit the second sub block into two partitions in the first direction.This is why a split mode parameter is not written into the bitstream.Namely, writing a split mode parameter into the bitstream is omitted orskipped. In contrast, when the split direction parameter indicates asecond direction different from the first direction, a split modeparameter indicating the number of partitions into which the second subblock is to be split is written into the bitstream, and the second subblock is split, in the second direction, into as many partitions as thenumber indicated by the split mode parameter The split directionparameter is one example of a first parameter indicating a direction inwhich the second sub block is to be split, whereas the split modeparameter is one example of a second parameter indicating the number ofpartitions into which the second sub block is to be split.

Advantageous Effects of Seventh Aspect

According to the present aspect, there is no need to encode a splitdirection or the number of partitions at some specific block sizes, andthis improves coding efficiency. The present disclosure also reduces thetotal number of partition structure candidates at an encoder side andthus reduces encoding complexity.

[Combination with Other Aspects]

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe processes in the flowcharts, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

[Eighth Aspect]

FIG. 28 illustrates an encoding method and an encoding process performedby an encoder according to the eighth aspect.

At step S8001, a block is split into first, second, and third sub blocksin a first direction.

At step S8002, it is determined whether each of the first and second subblocks is further split into two smaller partitions in a seconddirection different from the first direction.

At step S8003, when it is determined that each of the first and secondsub blocks is further split into two smaller partitions in the seconddirection different from the first direction, the third sub block issplit into smaller partitions. When the third sub block is split intotwo smaller partitions, the third sub block is split in the samedirection as the first direction.

At step S8004, when it is not determined that each of the first andsecond sub blocks is further split into two smaller partitions in thesecond direction different from the first direction, a split directionparameter is written into a bitstream. The split direction parameter mayindicate a horizontal or vertical direction, as illustrated in FIG. 30 .The location of a split direction parameter is illustrated in FIG. 31 .

At step S8005, the first sub block is split into smaller partitions inthe direction indicated by the split direction parameter.

Step S8006 is the same as step S5006.

FIG. 29 illustrates examples of a way to split a 64×64 block. In (a), a64×64 block is split first into two sub blocks in a vertical direction,and then each of the sub blocks is split into three partitions in ahorizontal direction. In (b), a 64×64 block is split first into threesub blocks in the horizontal direction, and then each of the sub blocksis split into two partitions.

In (b), a direction for splitting the 64×64 block into the first throughthird sub blocks is horizontal while a direction for splitting the firsttwo sub blocks (i.e., the first and second sub blocks) is vertical. Adirection for splitting the third sub block is horizontal that is thesame direction as the direction used for splitting the 64×64 block. Inother words, it is prohibited, in (b), to split the third sub block intotwo partitions in the vertical direction. This inhibits the occurrenceof the same partition structure in the mutually different splitting waysillustrated in (a) and (b).

At step S8005, the first sub block is split into two partitions in thedirection indicated by the split direction parameter.

It should be noted that the terms “write” and “into (a bitstream)” atstep S8004 and the term “encode” at step S8006 for the encoding methodand the encoding process performed by an encoder may be respectivelyreplaced with the terms “parse”, “from (the bitstream)”, and “decode”for a decoding method and a decoding process performed by a decoder.

Advantageous Effects of Eighth Aspect

According to the present aspect, there is no need to encode a splitdirection at some specific block sizes, and this improves codingefficiency. The present disclosure also reduces the total number ofpartition structure candidates at an encoder side and thus reducesencoding complexity.

[Combination with Other Aspects]

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe processes in the flowcharts, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

Variations

In all of the above-described aspects, it is possible to use one orplural thresholds for determining the number of smaller partitions and asplit direction for splitting a block. The thresholds may be adaptivelychanged according to a time layer, a quantization parameter, or a pixelvalue activity in a slice, or a combination of splitting patterns suchas a combination of a quadtree splitting, a binary tree splitting andany other splitting, or a combination of other coding tools includingtriangular splitting. The thresholds may be adaptively changed accordingto a block size such as a block width or a block height, or amultiplication of a block width and a block height. The thresholds maybe adaptively changed according to a block shape and/or a split depth.

It should be noted that the locations of a split mode parameter and asplit direction parameter are not limited to the locations illustratedin FIG. 31 . In other words, the signaling of a split mode parameter anda split direction parameter does not need to be performed limitedly at aCTU level, and any other level (e.g., a picture level, a slice level, atile group level, or a tile level) may be applied.

Note that a parameter indicating whether a block is to be split into twoor three sub blocks or partitions may be written into a bitstream. Inthis case, when the parameter indicates that a block is to be split intotwo or three sub blocks or partitions, the encoding method or decodingmethod according to each of the above-described aspects may be applied.

Other Embodiment

As described in each of the above embodiments, each functional block cantypically be realized as an MPU and memory, for example. Moreover,processes performed by each of the functional blocks are typicallyrealized by a program execution unit, such as a processor, reading andexecuting software (a program) recorded on a recording medium such asROM. The software may be distributed via, for example, downloading, andmay be recorded on a recording medium such as semiconductor memory anddistributed. Note that each functional block can, of course, also berealized as hardware (dedicated circuit).

Moreover, the processing described in each of the embodiments may berealized via integrated processing using a single apparatus (system),and, alternatively, may be realized via decentralized processing using aplurality of apparatuses. Moreover, the processor that executes theabove-described program may be a single processor or a plurality ofprocessors. In other words, integrated processing may be performed, and,alternatively, decentralized processing may be performed.

Embodiments of the present disclosure are not limited to the aboveexemplary embodiments; various modifications may be made to theexemplary embodiments, the results of which are also included within thescope of the aspects of the present disclosure.

Next, application examples of the moving picture encoding method (imageencoding method) and the moving picture decoding method (image decodingmethod) described in each of the above embodiments and a system thatemploys the same will be described. The system is characterized asincluding an image encoder that employs the image encoding method, animage decoder that employs the image decoding method, and an imageencoder/decoder that includes both the image encoder and the imagedecoder. Other configurations included in the system may beappropriately modified on a case-by-case basis.

Usage Examples

FIG. 32 illustrates an overall configuration of content providing systemex100 for implementing a content distribution service. The area in whichthe communication service is provided is divided into cells of desiredsizes, and base stations ex106, ex107, ex108, ex109, and ex110, whichare fixed wireless stations, are located in respective cells.

In content providing system ex100, devices including computer ex111,gaming device ex112, camera ex113, home appliance ex114, and smartphoneex115 are connected to internet ex101 via internet service providerex102 or communications network ex104 and base stations ex106 throughex110.

Content providing system ex100 may combine and connect any combinationof the above elements. The devices may be directly or indirectlyconnected together via a telephone network or near field communicationrather than via base stations ex106 through ex110, which are fixedwireless stations. Moreover, streaming server ex103 is connected todevices including computer ex111, gaming device ex112, camera ex113,home appliance ex114, and smartphone ex115 via, for example, internetex101. Streaming server ex103 is also connected to, for example, aterminal in a hotspot in airplane ex117 via satellite ex116.

Note that instead of base stations ex106 through ex110, wireless accesspoints or hotspots may be used. Streaming server ex103 may be connectedto communications network ex104 directly instead of via internet ex101or internet service provider ex102, and may be connected to airplaneex117 directly instead of via satellite ex116.

Camera ex113 is a device capable of capturing still images and video,such as a digital camera. Smartphone ex115 is a smartphone device,cellular phone, or personal handyphone system (PHS) phone that canoperate under the mobile communications system standards of the typical2G, 3G, 3.9G, and 4G systems, as well as the next-generation 5G system.

Home appliance ex118 is, for example, a refrigerator or a deviceincluded in a home fuel cell cogeneration system.

In content providing system ex100, a terminal including an image and/orvideo capturing function is capable of, for example, live streaming byconnecting to streaming server ex103 via, for example, base stationex106. When live streaming, a terminal (e.g., computer ex111, gamingdevice ex112, camera ex113, home appliance ex114, smartphone ex115, orairplane ex117) performs the encoding processing described in the aboveembodiments on still-image or video content captured by a user via theterminal, multiplexes video data obtained via the encoding and audiodata obtained by encoding audio corresponding to the video, andtransmits the obtained data to streaming server ex103. In other words,the terminal functions as the image encoder according to one aspect ofthe present disclosure.

Streaming server ex103 streams transmitted content data to clients thatrequest the stream. Client examples include computer ex111, gamingdevice ex112, camera ex113, home appliance ex114, smartphone ex115, andterminals inside airplane ex117, which are capable of decoding theabove-described encoded data. Devices that receive the streamed datadecode and reproduce the received data. In other words, the devices eachfunction as the image decoder according to one aspect of the presentdisclosure.

[Decentralized Processing]

Streaming server ex103 may be realized as a plurality of servers orcomputers between which tasks such as the processing, recording, andstreaming of data are divided. For example, streaming server ex103 maybe realized as a content delivery network (CDN) that streams content viaa network connecting multiple edge servers located throughout the world.In a CDN, an edge server physically near the client is dynamicallyassigned to the client. Content is cached and streamed to the edgeserver to reduce load times. In the event of, for example, some kind ofan error or a change in connectivity due to, for example, a spike intraffic, it is possible to stream data stably at high speeds since it ispossible to avoid affected parts of the network by, for example,dividing the processing between a plurality of edge servers or switchingthe streaming duties to a different edge server, and continuingstreaming.

Decentralization is not limited to just the division of processing forstreaming; the encoding of the captured data may be divided between andperformed by the terminals, on the server side, or both. In one example,in typical encoding, the processing is performed in two loops. The firstloop is for detecting how complicated the image is on a frame-by-frameor scene-by-scene basis, or detecting the encoding load. The second loopis for processing that maintains image quality and improves encodingefficiency. For example, it is possible to reduce the processing load ofthe terminals and improve the quality and encoding efficiency of thecontent by having the terminals perform the first loop of the encodingand having the server side that received the content perform the secondloop of the encoding. In such a case, upon receipt of a decodingrequest, it is possible for the encoded data resulting from the firstloop performed by one terminal to be received and reproduced on anotherterminal in approximately real time. This makes it possible to realizesmooth, real-time streaming.

In another example, camera ex113 or the like extracts a feature amountfrom an image, compresses data related to the feature amount asmetadata, and transmits the compressed metadata to a server. Forexample, the server determines the significance of an object based onthe feature amount and changes the quantization accuracy accordingly toperform compression suitable for the meaning of the image. Featureamount data is particularly effective in improving the precision andefficiency of motion vector prediction during the second compressionpass performed by the server. Moreover, encoding that has a relativelylow processing load, such as variable length coding (VLC), may behandled by the terminal, and encoding that has a relatively highprocessing load, such as context-adaptive binary arithmetic coding(CABAC), may be handled by the server.

In yet another example, there are instances in which a plurality ofvideos of approximately the same scene are captured by a plurality ofterminals in, for example, a stadium, shopping mall, or factory. In sucha case, for example, the encoding may be decentralized by dividingprocessing tasks between the plurality of terminals that captured thevideos and, if necessary, other terminals that did not capture thevideos and the server, on a per-unit basis. The units may be, forexample, groups of pictures (GOP), pictures, or tiles resulting fromdividing a picture. This makes it possible to reduce load times andachieve streaming that is closer to real-time.

Moreover, since the videos are of approximately the same scene,management and/or instruction may be carried out by the server so thatthe videos captured by the terminals can be cross-referenced. Moreover,the server may receive encoded data from the terminals, change referencerelationship between items of data or correct or replace picturesthemselves, and then perform the encoding. This makes it possible togenerate a stream with increased quality and efficiency for theindividual items of data.

Moreover, the server may stream video data after performing transcodingto convert the encoding format of the video data. For example, theserver may convert the encoding format from MPEG to VP, and may convertH.264 to H.265.

In this way, encoding can be performed by a terminal or one or moreservers. Accordingly, although the device that performs the encoding isreferred to as a “server” or “terminal” in the following description,some or all of the processes performed by the server may be performed bythe terminal, and likewise some or all of the processes performed by theterminal may be performed by the server. This also applies to decodingprocesses.

[3D, Multi-Angle]

In recent years, usage of images or videos combined from images orvideos of different scenes concurrently captured or the same scenecaptured from different angles by a plurality of terminals such ascamera ex113 and/or smartphone ex115 has increased. Videos captured bythe terminals are combined based on, for example, theseparately-obtained relative positional relationship between theterminals, or regions in a video having matching feature points.

In addition to the encoding of two-dimensional moving pictures, theserver may encode a still image based on scene analysis of a movingpicture either automatically or at a point in time specified by theuser, and transmit the encoded still image to a reception terminal.Furthermore, when the server can obtain the relative positionalrelationship between the video capturing terminals, in addition totwo-dimensional moving pictures, the server can generatethree-dimensional geometry of a scene based on video of the same scenecaptured from different angles. Note that the server may separatelyencode three-dimensional data generated from, for example, a pointcloud, and may, based on a result of recognizing or tracking a person orobject using three-dimensional data, select or reconstruct and generatea video to be transmitted to a reception terminal from videos capturedby a plurality of terminals.

This allows the user to enjoy a scene by freely selecting videoscorresponding to the video capturing terminals, and allows the user toenjoy the content obtained by extracting, from three-dimensional datareconstructed from a plurality of images or videos, a video from aselected viewpoint. Furthermore, similar to with video, sound may berecorded from relatively different angles, and the server may multiplex,with the video, audio from a specific angle or space in accordance withthe video, and transmit the result.

In recent years, content that is a composite of the real world and avirtual world, such as virtual reality (VR) and augmented reality (AR)content, has also become popular. In the case of VR images, the servermay create images from the viewpoints of both the left and right eyesand perform encoding that tolerates reference between the two viewpointimages, such as multi-view coding (MVC), and, alternatively, may encodethe images as separate streams without referencing. When the images aredecoded as separate streams, the streams may be synchronized whenreproduced so as to recreate a virtual three-dimensional space inaccordance with the viewpoint of the user.

In the case of AR images, the server superimposes virtual objectinformation existing in a virtual space onto camera informationrepresenting a real-world space, based on a three-dimensional positionor movement from the perspective of the user. The decoder may obtain orstore virtual object information and three-dimensional data, generatetwo-dimensional images based on movement from the perspective of theuser, and then generate superimposed data by seamlessly connecting theimages. Alternatively, the decoder may transmit, to the server, motionfrom the perspective of the user in addition to a request for virtualobject information, and the server may generate superimposed data basedon three-dimensional data stored in the server in accordance with thereceived motion, and encode and stream the generated superimposed datato the decoder. Note that superimposed data includes, in addition to RGBvalues, an a value indicating transparency, and the server sets the avalue for sections other than the object generated fromthree-dimensional data to, for example, 0, and may perform the encodingwhile those sections are transparent. Alternatively, the server may setthe background to a predetermined RGB value, such as a chroma key, andgenerate data in which areas other than the object are set as thebackground.

Decoding of similarly streamed data may be performed by the client(i.e., the terminals), on the server side, or divided therebetween. Inone example, one terminal may transmit a reception request to a server,the requested content may be received and decoded by another terminal,and a decoded signal may be transmitted to a device having a display. Itis possible to reproduce high image quality data by decentralizingprocessing and appropriately selecting content regardless of theprocessing ability of the communications terminal itself. In yet anotherexample, while a TV, for example, is receiving image data that is largein size, a region of a picture, such as a tile obtained by dividing thepicture, may be decoded and displayed on a personal terminal orterminals of a viewer or viewers of the TV. This makes it possible forthe viewers to share a big-picture view as well as for each viewer tocheck his or her assigned area or inspect a region in further detail upclose.

In the future, both indoors and outdoors, in situations in which aplurality of wireless connections are possible over near, mid, and fardistances, it is expected to be able to seamlessly receive content evenwhen switching to data appropriate for the current connection, using astreaming system standard such as MPEG-DASH. With this, the user canswitch between data in real time while freely selecting a decoder ordisplay apparatus including not only his or her own terminal, but also,for example, displays disposed indoors or outdoors. Moreover, based on,for example, information on the position of the user, decoding can beperformed while switching which terminal handles decoding and whichterminal handles the displaying of content. This makes it possible to,while in route to a destination, display, on the wall of a nearbybuilding in which a device capable of displaying content is embedded oron part of the ground, map information while on the move. Moreover, itis also possible to switch the bit rate of the received data based onthe accessibility to the encoded data on a network, such as when encodeddata is cached on a server quickly accessible from the receptionterminal or when encoded data is copied to an edge server in a contentdelivery service.

[Scalable Encoding]

The switching of content will be described with reference to a scalablestream, illustrated in FIG. 33 , which is compression coded viaimplementation of the moving picture encoding method described in theabove embodiments. The server may have a configuration in which contentis switched while making use of the temporal and/or spatial scalabilityof a stream, which is achieved by division into and encoding of layers,as illustrated in FIG. 33 . Note that there may be a plurality ofindividual streams that are of the same content but different quality.In other words, by determining which layer to decode up to based oninternal factors, such as the processing ability on the decoder side,and external factors, such as communication bandwidth, the decoder sidecan freely switch between low resolution content and high resolutioncontent while decoding. For example, in a case in which the user wantsto continue watching, at home on a device such as a TV connected to theinternet, a video that he or she had been previously watching onsmartphone ex115 while on the move, the device can simply decode thesame stream up to a different layer, which reduces server side load.

Furthermore, in addition to the configuration described above in whichscalability is achieved as a result of the pictures being encoded perlayer and the enhancement layer is above the base layer, the enhancementlayer may include metadata based on, for example, statisticalinformation on the image, and the decoder side may generate high imagequality content by performing super-resolution imaging on a picture inthe base layer based on the metadata. Super-resolution imaging may beimproving the SN ratio while maintaining resolution and/or increasingresolution. Metadata includes information for identifying a linear or anon-linear filter coefficient used in super-resolution processing, orinformation identifying a parameter value in filter processing, machinelearning, or least squares method used in super-resolution processing.

Alternatively, a configuration in which a picture is divided into, forexample, tiles in accordance with the meaning of, for example, an objectin the image, and on the decoder side, only a partial region is decodedby selecting a tile to decode, is also acceptable. Moreover, by storingan attribute about the object (person, car, ball, etc.) and a positionof the object in the video (coordinates in identical images) asmetadata, the decoder side can identify the position of a desired objectbased on the metadata and determine which tile or tiles include thatobject. For example, as illustrated in FIG. 34 , metadata is storedusing a data storage structure different from pixel data such as an SEImessage in HEVC. This metadata indicates, for example, the position,size, or color of the main object.

Moreover, metadata may be stored in units of a plurality of pictures,such as stream, sequence, or random access units. With this, the decoderside can obtain, for example, the time at which a specific personappears in the video, and by fitting that with picture unit information,can identify a picture in which the object is present and the positionof the object in the picture.

[Web Page Optimization]

FIG. 35 illustrates an example of a display screen of a web page on, forexample, computer ex111. FIG. 36 illustrates an example of a displayscreen of a web page on, for example, smartphone ex115. As illustratedin FIG. 35 and FIG. 36 , a web page may include a plurality of imagelinks which are links to image content, and the appearance of the webpage differs depending on the device used to view the web page. When aplurality of image links are viewable on the screen, until the userexplicitly selects an image link, or until the image link is in theapproximate center of the screen or the entire image link fits in thescreen, the display apparatus (decoder) displays, as the image links,still images included in the content or I pictures, displays video suchas an animated gif using a plurality of still images or I pictures, forexample, or receives only the base layer and decodes and displays thevideo.

When an image link is selected by the user, the display apparatusdecodes giving the highest priority to the base layer. Note that ifthere is information in the HTML code of the web page indicating thatthe content is scalable, the display apparatus may decode up to theenhancement layer. Moreover, in order to guarantee real timereproduction, before a selection is made or when the bandwidth isseverely limited, the display apparatus can reduce delay between thepoint in time at which the leading picture is decoded and the point intime at which the decoded picture is displayed (that is, the delaybetween the start of the decoding of the content to the displaying ofthe content) by decoding and displaying only forward reference pictures(I picture, P picture, forward reference B picture). Moreover, thedisplay apparatus may purposely ignore the reference relationshipbetween pictures and coarsely decode all B and P pictures as forwardreference pictures, and then perform normal decoding as the number ofpictures received over time increases.

[Autonomous Driving]

When transmitting and receiving still image or video data such two- orthree-dimensional map information for autonomous driving or assisteddriving of an automobile, the reception terminal may receive, inaddition to image data belonging to one or more layers, information on,for example, the weather or road construction as metadata, and associatethe metadata with the image data upon decoding. Note that metadata maybe assigned per layer and, alternatively, may simply be multiplexed withthe image data.

In such a case, since the automobile, drone, airplane, etc., includingthe reception terminal is mobile, the reception terminal can seamlesslyreceive and decode while switching between base stations among basestations ex106 through ex110 by transmitting information indicating theposition of the reception terminal upon reception request. Moreover, inaccordance with the selection made by the user, the situation of theuser, or the bandwidth of the connection, the reception terminal candynamically select to what extent the metadata is received or to whatextent the map information, for example, is updated.

With this, in content providing system ex100, the client can receive,decode, and reproduce, in real time, encoded information transmitted bythe user.

[Streaming of Individual Content]

In content providing system ex100, in addition to high image quality,long content distributed by a video distribution entity, unicast ormulticast streaming of low image quality, short content from anindividual is also possible. Moreover, such content from individuals islikely to further increase in popularity. The server may first performediting processing on the content before the encoding processing inorder to refine the individual content. This may be achieved with, forexample, the following configuration.

In real-time while capturing video or image content or after the contenthas been captured and accumulated, the server performs recognitionprocessing based on the raw or encoded data, such as capture errorprocessing, scene search processing, meaning analysis, and/or objectdetection processing. Then, based on the result of the recognitionprocessing, the server-either when prompted or automatically-edits thecontent, examples of which include: correction such as focus and/ormotion blur correction; removing low-priority scenes such as scenes thatare low in brightness compared to other pictures or out of focus; objectedge adjustment; and color tone adjustment. The server encodes theedited data based on the result of the editing. It is known thatexcessively long videos tend to receive fewer views. Accordingly, inorder to keep the content within a specific length that scales with thelength of the original video, the server may, in addition to thelow-priority scenes described above, automatically clip out scenes withlow movement based on an image processing result. Alternatively, theserver may generate and encode a video digest based on a result of ananalysis of the meaning of a scene.

Note that there are instances in which individual content may includecontent that infringes a copyright, moral right, portrait rights, etc.Such an instance may lead to an unfavorable situation for the creator,such as when content is shared beyond the scope intended by the creator.Accordingly, before encoding, the server may, for example, edit imagesso as to blur faces of people in the periphery of the screen or blur theinside of a house, for example. Moreover, the server may be configuredto recognize the faces of people other than a registered person inimages to be encoded, and when such faces appear in an image, forexample, apply a mosaic filter to the face of the person. Alternatively,as pre- or post-processing for encoding, the user may specify, forcopyright reasons, a region of an image including a person or a regionof the background be processed, and the server may process the specifiedregion by, for example, replacing the region with a different image orblurring the region. If the region includes a person, the person may betracked in the moving picture the head region may be replaced withanother image as the person moves.

Moreover, since there is a demand for real-time viewing of contentproduced by individuals, which tends to be small in data size, thedecoder first receives the base layer as the highest priority andperforms decoding and reproduction, although this may differ dependingon bandwidth. When the content is reproduced two or more times, such aswhen the decoder receives the enhancement layer during decoding andreproduction of the base layer and loops the reproduction, the decodermay reproduce a high image quality video including the enhancementlayer. If the stream is encoded using such scalable encoding, the videomay be low quality when in an unselected state or at the start of thevideo, but it can offer an experience in which the image quality of thestream progressively increases in an intelligent manner. This is notlimited to just scalable encoding; the same experience can be offered byconfiguring a single stream from a low quality stream reproduced for thefirst time and a second stream encoded using the first stream as areference.

Other Usage Examples

The encoding and decoding may be performed by LSI ex500, which istypically included in each terminal. LSI ex500 may be configured of asingle chip or a plurality of chips. Software for encoding and decodingmoving pictures may be integrated into some type of a recording medium(such as a CD-ROM, a flexible disk, or a hard disk) that is readable by,for example, computer ex111, and the encoding and decoding may beperformed using the software. Furthermore, when smartphone ex115 isequipped with a camera, the video data obtained by the camera may betransmitted. In this case, the video data is coded by LSI ex500 includedin smartphone ex115.

Note that LSI ex500 may be configured to download and activate anapplication. In such a case, the terminal first determines whether it iscompatible with the scheme used to encode the content or whether it iscapable of executing a specific service. When the terminal is notcompatible with the encoding scheme of the content or when the terminalis not capable of executing a specific service, the terminal firstdownloads a codec or application software then obtains and reproducesthe content.

Aside from the example of content providing system ex100 that usesinternet ex101, at least the moving picture encoder (image encoder) orthe moving picture decoder (image decoder) described in the aboveembodiments may be implemented in a digital broadcasting system. Thesame encoding processing and decoding processing may be applied totransmit and receive broadcast radio waves superimposed with multiplexedaudio and video data using, for example, a satellite, even though thisis geared toward multicast whereas unicast is easier with contentproviding system ex100.

[Hardware Configuration]

FIG. 37 illustrates smartphone ex115. FIG. 38 illustrates aconfiguration example of smartphone ex115. Smartphone ex115 includesantenna ex450 for transmitting and receiving radio waves to and frombase station ex110, camera ex465 capable of capturing video and stillimages, and display ex458 that displays decoded data, such as videocaptured by camera ex465 and video received by antenna ex450. Smartphoneex115 further includes user interface ex466 such as a touch panel, audiooutput unit ex457 such as a speaker for outputting speech or otheraudio, audio input unit ex456 such as a microphone for audio input,memory ex467 capable of storing decoded data such as captured video orstill images, recorded audio, received video or still images, and mail,as well as decoded data, and slot ex464 which is an interface for SIMex468 for authorizing access to a network and various data. Note thatexternal memory may be used instead of memory ex467.

Moreover, main controller ex460 which comprehensively controls displayex458 and user interface ex466, power supply circuit ex461, userinterface input controller ex462, video signal processor ex455, camerainterface ex463, display controller ex459, modulator/demodulator ex452,multiplexer/demultiplexer ex453, audio signal processor ex454, slotex464, and memory ex467 are connected via bus ex470.

When the user turns the power button of power supply circuit ex461 on,smartphone ex115 is powered on into an operable state by each componentbeing supplied with power from a battery pack.

Smartphone ex115 performs processing for, for example, calling and datatransmission, based on control performed by main controller ex460, whichincludes a CPU, ROM, and RAM. When making calls, an audio signalrecorded by audio input unit ex456 is converted into a digital audiosignal by audio signal processor ex454, and this is applied with spreadspectrum processing by modulator/demodulator ex452 and digital-analogconversion and frequency conversion processing by transmitter/receiverex451, and then transmitted via antenna ex450. The received data isamplified, frequency converted, and analog-digital converted, inversespread spectrum processed by modulator/demodulator ex452, converted intoan analog audio signal by audio signal processor ex454, and then outputfrom audio output unit ex457. In data transmission mode, text,still-image, or video data is transmitted by main controller ex460 viauser interface input controller ex462 as a result of operation of, forexample, user interface ex466 of the main body, and similar transmissionand reception processing is performed. In data transmission mode, whensending a video, still image, or video and audio, video signal processorex455 compression encodes, via the moving picture encoding methoddescribed in the above embodiments, a video signal stored in memoryex467 or a video signal input from camera ex465, and transmits theencoded video data to multiplexer/demultiplexer ex453. Moreover, audiosignal processor ex454 encodes an audio signal recorded by audio inputunit ex456 while camera ex465 is capturing, for example, a video orstill image, and transmits the encoded audio data tomultiplexer/demultiplexer ex453. Multiplexer/demultiplexer ex453multiplexes the encoded video data and encoded audio data using apredetermined scheme, modulates and converts the data usingmodulator/demodulator (modulator/demodulator circuit) ex452 andtransmitter/receiver ex451, and transmits the result via antenna ex450.

When video appended in an email or a chat, or a video linked from a webpage, for example, is received, in order to decode the multiplexed datareceived via antenna ex450, multiplexer/demultiplexer ex453demultiplexes the multiplexed data to divide the multiplexed data into abitstream of video data and a bitstream of audio data, supplies theencoded video data to video signal processor ex455 via synchronous busex470, and supplies the encoded audio data to audio signal processorex454 via synchronous bus ex470. Video signal processor ex455 decodesthe video signal using a moving picture decoding method corresponding tothe moving picture encoding method described in the above embodiments,and video or a still image included in the linked moving picture file isdisplayed on display ex458 via display controller ex459. Moreover, audiosignal processor ex454 decodes the audio signal and outputs audio fromaudio output unit ex457. Note that since real-time streaming is becomingmore and more popular, there are instances in which reproduction of theaudio may be socially inappropriate depending on the user's environment.Accordingly, as an initial value, a configuration in which only videodata is reproduced, i.e., the audio signal is not reproduced, ispreferable. Audio may be synchronized and reproduced only when an input,such as when the user clicks video data, is received.

Although smartphone ex115 was used in the above example, threeimplementations are conceivable: a transceiver terminal including bothan encoder and a decoder; a transmitter terminal including only anencoder; and a receiver terminal including only a decoder. Further, inthe description of the digital broadcasting system, an example is givenin which multiplexed data obtained as a result of video data beingmultiplexed with, for example, audio data, is received or transmitted,but the multiplexed data may be video data multiplexed with data otherthan audio data, such as text data related to the video. Moreover, thevideo data itself rather than multiplexed data may be received ortransmitted.

Although main controller ex460 including a CPU is described ascontrolling the encoding or decoding processes, terminals often includeGPUs. Accordingly, a configuration is acceptable in which a large areais processed at once by making use of the performance ability of the GPUvia memory shared by the CPU and GPU or memory including an address thatis managed so as to allow common usage by the CPU and GPU. This makes itpossible to shorten encoding time, maintain the real-time nature of thestream, and reduce delay. In particular, processing relating to motionestimation, deblocking filtering, sample adaptive offset (SAO), andtransformation/quantization can be effectively carried out by the GPUinstead of the CPU in units of, for example pictures, all at once.

Although only some exemplary embodiments of the present disclosure havebeen described in detail above, those skilled in the art will readilyappreciate that many modifications are possible in the exemplaryembodiments without materially departing from the novel teachings andadvantages of the present disclosure. Accordingly, all suchmodifications are intended to be included within the scope of thepresent disclosure.

INDUSTRIAL APPLICABILITY

The present disclosure is applicable to, for example, televisionreceivers, digital video recorders, car navigation systems, mobilephones, digital cameras, and digital video cameras.

What is claimed is:
 1. An encoder comprising: circuitry; and a memorycoupled to the circuitry, wherein the circuitry, in operation:determines whether or not a ternary split process of splitting a blockinto three sub blocks in a first direction parallel to a first longerside of the block is allowed by comparing a size of a second shorterside of the block to a minimum threshold value; responsive to theternary split process being allowed, writes, into a bitstream, a splitdirection parameter indicative of a splitting direction; splits theblock into a plurality of sub blocks in a direction indicated by thesplit direction parameter; and encodes the plurality of sub blocks. 2.An encoding method, comprising: determining whether or not a ternarysplit process of splitting a block into three sub blocks in a firstdirection parallel to a first longer side of the block is allowed bycomparing a size of a second shorter side of the block to a minimumthreshold value; responsive to the ternary split process being allowed,writing, into a bitstream, a split direction parameter indicative of asplitting direction; splitting the block into a plurality of sub blocksin a direction indicated by the split direction parameter; and encodingthe plurality of sub blocks.
 3. A non-transitory computer readablemedium storing a bitstream, the bitstream including: a split directionparameter indicative of a splitting direction; and syntax informationconfigured to cause a computer to perform a decoding process including:determining whether or not a ternary split process of splitting a blockinto three sub blocks in a first direction parallel to a first longerside of the block is allowed by comparing a size of a second shorterside of the block to a minimum threshold value; responsive to theternary split process being allowed, parsing, from the bitstream, thesplit direction parameter indicative of the splitting direction;splitting the block into a plurality of sub blocks in a directionindicated by the split direction parameter; and decoding the pluralityof sub blocks.